Complete graph - PDFSEARCH.IO - Document Search Engine

Complete graph
Results: 868

#	Item
441	Parameterized Complexity for the Database Theorist Martin Grohe Division of Informatics, University of Edinburgh, Edinburgh EH9 3JZ, Scotland, UK. Email: 1 . Introduction Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2006-07-04 06:02:43 NP-complete problems Analysis of algorithms Complexity classes Parameterized complexity Graph coloring Dominating set FO Time complexity Tree decomposition Theoretical computer science Computational complexity theory Applied mathematics
442	July 25, 2007 Problem 1. Real numbers a1 , a2 , . . . , an are given. For each i (1 ≤ i ≤ n) define di = max{aj : 1 ≤ j ≤ i} − min{aj : i ≤ j ≤ n} and let d = max{di : 1 ≤ i ≤ n}. Add to Reading List Source URL: www.georgmohr.dk Language: English - Date: 2007-08-06 03:47:34 Graph operations Clique problem Graph theory Clique NP-complete problems
443	Multiplicative approximations of random walk transition probabilities Michael Kapralov∗ Rina Panigrahy† June 17, 2011 Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2014-12-09 10:13:50 Analysis of algorithms Probabilistic complexity theory Randomized algorithm Connectivity Random walk NP-complete problems Algebraic graph theory Centrality Tutte polynomial Theoretical computer science Computational complexity theory Mathematics
444	Parameterized Complexity-News The Newsletter of the Parameterized Complexity Community Volume 2, NovemberWelcome Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-09-04 06:03:49 NP-complete problems Analysis of algorithms Parameterized complexity Graph coloring Bidimensionality Kernelization Dominating set Branch-decomposition Vertex cover Theoretical computer science Graph theory Computational complexity theory
445	Claw-free graphs and two conjectures on omega, Delta, and chi Andrew King School of Computer Science McGill University, Montreal October 2009 Add to Reading List Source URL: andrewdouglasking.com.s3-website-us-west-2.amazonaws.com Language: English - Date: 2015-03-20 01:35:59 Graph operations Line graph Claw-free graph Clique Perfect graph Chordal graph Interval graph Neighbourhood Graph property Graph theory Graph coloring NP-complete problems
446	Incremental List Coloring of Graphs, Parameterized by Conservation2 Sepp Hartung and Rolf Niedermeier TU Berlin Institut f¨ ur Softwaretechnik und Theoretische Informatik Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2013-02-01 23:13:02 Graph coloring NP-complete problems Analysis of algorithms Parameterized complexity List coloring Graph Travelling salesman problem Kernelization Edge coloring Graph theory Theoretical computer science Mathematics
447	CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Memory Requirements for Local Geometric Routing and Traversal in Digraphs M. Fraser Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:05:29 Graph Planar graph Unit disk graph Geographic routing Graph theory Theoretical computer science NP-complete problems
448	Newsletter of the PC Community NovemberWelcome Bergen Algorithmics Wins Big Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 04:47:38 NP-complete problems Analysis of algorithms Parameterized complexity Graph operations Graph coloring Bidimensionality Kernelization Clique Dominating set Theoretical computer science Graph theory Computational complexity theory
449	Ann Math Artif Intell:281–305 DOIs10472A framework for multi-robot node coverage in sensor networks Andrea Gasparri · Bhaskar Krishnamachari · Add to Reading List Source URL: robotics.usc.edu Language: English - Date: 2014-06-13 19:42:54 NP-complete problems Network theory Operations research Travelling salesman problem Motion planning Robotics Shortest path problem Mobile robot Robot Theoretical computer science Mathematics Graph theory
450	manhat-conn-xact-color.dvi Add to Reading List Source URL: daniel-wilkerson.appspot.com Language: English NP-complete problems Graph coloring Graph theory NP-complete One-in-three 3SAT 2-satisfiability Theoretical computer science Mathematics Computational complexity theory

UPDATE